A Novel, Energy-Aware Task Duplication-Based Scheduling Algorithm of Parallel Tasks on Clusters
نویسندگان
چکیده
منابع مشابه
A Novel, Energy-Aware Task Duplication-Based Scheduling Algorithm of Parallel Tasks on Clusters
Increasing energy has become an important issue in high performance clusters. To balance the energy and performance, we proposed a novel, energy-aware duplication-based scheduling (NEADS). An existing energy-aware duplication-based algorithm replicates all qualified predecessor tasks in a bottom-up manner. Some tasks without direct relation may be replicated to the same processor, which cannot ...
متن کاملAn Energy-aware Dynamic Clustering-based Scheduling Algorithm for Parallel tasks on Clusters
The paper proposes an energy-aware dynamic clustering-based scheduling algorithm that aims at reducing communication energy consumption through clustering dependent tasks. A job can be described by a direct acyclic graph (DAG) of parallel tasks. Because the execution time is hard to estimate accurately, the current static scheduling strategies may cause energy increase due to task waiting. The ...
متن کاملGreen Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملA Task Duplication Based Scheduling Algorithm for Avoiding Useless Duplication
In this paper, we propose a task duplication based scheduling algorithm for avoiding useless duplication. In our algorithm, task duplication is divided into two phases: a task fill phase and a task duplication phase. In the task fill phase, tasks are duplicated and allocated to idle time slots in used processors. Namely, the task fill phase does not require additional idle processors. The task ...
متن کاملAn Optimal Scheduling Algorithm Based on Task Duplication
The task scheduling problem in distributed memory machines is to allocate the tasks of an application into processors in order to minimize the total execution time. This is known as an NP-complete problem. Under the condition where the communication time is relatively shorter than the computation time for every task, the task duplication based scheduling (TDS) algorithm proposed by Darbha and A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computational Applications
سال: 2016
ISSN: 2297-8747
DOI: 10.3390/mca22010002